Subdominant matroid ultrametrics
نویسنده
چکیده
Given a matroid M on the ground set E, the Bergman fan B̃(M), or space of M -ultrametrics, is a polyhedral complex in RE which arises in several different areas, such as tropical algebraic geometry, dynamical systems, and phylogenetics. Motivated by the phylogenetic situation, we study the following problem: Given a point ω in RE , we wish to find an M -ultrametric which is closest to it in the "∞-metric. The solution to this problem follows easily from the existence of the subdominant M -ultrametric: a componentwise maximum M -ultrametric which is componentwise smaller than ω. A procedure for computing it is given, which brings together the points of view of matroid theory and tropical geometry. When the matroid in question is the graphical matroid of the complete graph Kn, the Bergman fan B̃(Kn) parameterizes the equidistant phylogenetic trees with n leaves. In this case, our results provide a conceptual explanation for Chepoi and Fichet’s method for computing the tree that most closely matches measured data.
منابع مشابه
l - Approximation via Subdominants
Given a vector u and a certain subset K of a real vector space E, the problem of l -approximation involves determining an element û in K nearest to u in the sense of the l -error norm. The subdominant * of u is the upper bound (if it exists) of the set [x # K : xOu] (we let xOy if all coordinates of x are smaller than or equal to the corresponding coordinates of y). We present general condition...
متن کاملBinary clustering
In many clustering systems (hierarchies, pyramids and more generally weak hierarchies) clusters are generated by two elements only. This paper is devoted to such clustering systems (called binary clustering systems). It provides some basic properties, links with (closed) weak hierarchies and some qualitative versions of bijection theorems that occur in Numerical Taxonomy. Moreover, a way to ass...
متن کاملUltra valuations
This paper proposes an original exchange property of valuations.This property is shown to be equivalent to a property described by Dress and Terhalle in the context of discrete optimization and matroids and shown there to characterize the valuations for which the demand oracle can be implemented by a greedy algorithm. The same exchange property is also equivalent to a property described indepen...
متن کاملOn Tree Representations of Relations and Graphs: Symbolic Ultrametrics and Cograph Edge Decompositions
Tree representations of (sets of) symmetric binary relations, or equivalently edge-colored undirected graphs, are of central interest, e.g. in phylogenomics. In this context symbolic ultrametrics play a crucial role. Symbolic ultrametrics define an edge-colored complete graph that allows to represent the topology of this graph as a vertex-colored tree. Here, we are interested in the structure a...
متن کاملOrthology relations, symbolic ultrametrics, and cographs.
Orthology detection is an important problem in comparative and evolutionary genomics and, consequently, a variety of orthology detection methods have been devised in recent years. Although many of these methods are dependent on generating gene and/or species trees, it has been shown that orthology can be estimated at acceptable levels of accuracy without having to infer gene trees and/or reconc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005